Search results for "Traveling repairman problem"
showing 1 items of 1 documents
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
2011
Abstract: The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.